Analysis of Bounded Variation Penalty Methodsfor Ill - Posed
نویسندگان
چکیده
This paper presents an abstract analysis of bounded variation (BV) methods for ill-posed operator equations Au = z. Let T(u) def = kAu ? zk 2 + J(u); where the penalty, or \regularization", parameter > 0 and the functional J(u) is the BV norm or seminorm of u, also known as the total variation of u. Under mild restrictions on the operator A and the functional J(u), it is shown that the functional T(u) has a unique minimizer which is stable with respect to certain perturbations in the data z, the operator A, the parameter , and the functional J(u). In addition, convergence results are obtained which apply when these perturbations vanish and the regularization parameter is chosen appropriately.
منابع مشابه
Analysis of bounded variation penalty methods for ill - posed problems
This paper presents an abstract analysis of bounded variation (BY) methods for illposed apentor equations Au = L. Let where the penalty, or 'regularization'. parameter (I > 0 and the functional J ( u ) is the BY norm or semi-norm of U , also known 3s the total variation of U. Under mild restrictions on the operator A and the functional J ( u ) , it is shown that the functional T ( u ) has a uni...
متن کاملInverse Problems with Second-order Total Generalized Variation Constraints
Total Generalized Variation (TGV) has recently been introduced as penalty functional for modelling images with edges as well as smooth variations [2]. It can be interpreted as a “sparse” penalization of optimal balancing from the first up to the kth distributional derivative and leads to desirable results when applied to image denoising, i.e., L-fitting with TGV penalty. The present paper studi...
متن کاملComplexity of linear ill-posed problems in Hilbert space
Information complexity of ill-posed problems may be seen as controversial. On the one hand side there were pessimistic results stating that the complexity is in nite, while on the other hand side the theory of ill-posed problems is well developed. In contrast to well-posed problems (continuous solution operators) the complexity analysis of ill-posed problems (discontinuous solution operators) i...
متن کاملResolution of sharp fronts in the presence of model error in variational data assimilation
We show that data assimilation using four-dimensional variation (4DVar) can be interpreted as a form of Tikhonov regularisation, a very familiar method for solving ill-posed inverse problems. It is known from image restoration problems that L1-norm penalty regularisation recovers sharp edges in the image more accurately than Tikhonov, or L2-norm, penalty regularisation. We apply this idea to 4D...
متن کاملThresholding estimators for minimax restoration and deconvolution
Inverting the distortion of signals and images in presence of additive noise is often numerically unstable. To solve these ill-posed inverse problems, we study linear and non-linear diagonal estimators in an orthogonal basis. General conditions are given to build nearly minimax optimal estimators with a thresholding in an orthogonal basis. As an application, we study the deconvolution of bounde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994